An almost optimal algorithm for Winkler's sorting pairs in bins
نویسندگان
چکیده
منابع مشابه
An Almost Optimal PAC Algorithm
The best currently known general lower and upper bounds on the number of labeled examples needed for learning a concept class in the PAC framework (the realizable case) do not perfectly match: they leave a gap of order log(1/ ) (resp. a gap which is logarithmic in another one of the relevant parameters). It is an unresolved question whether there exists an “optimal PAC algorithm” which establis...
متن کاملAn Almost Optimal Algorithm for Unbounded Searching
Unbounded searching can be viewed as searching an ordered table of infinite size. In this paper we present an algorithm for unbounded searching and derive a lower bound on the number of comparisons required which shows that the algorithm is very nearly optimal. (Submitted to Information Processing Letters) * Work supported in part by U. S. Energy Research and Development Administration under co...
متن کاملAn Optimal Parallel Algorithm for Sorting Multisets
We consider the problem of sorting n numbers that contain only k distinct values. We present a randomized arbitrary CRCW PRAM algorithm that runs in O(logn) time using n log k logn processors. The same algorithm runs in O ( logn log logn ) time with a total work of O(n(log k) ) for any fixed > 0. All the stated bounds hold with high probability.
متن کاملOptimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II
The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...
متن کاملAn Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
This paper considers a solution to the multiprocessor scheduling problem for the case where the ordering relation between tasks can be represented as a tree. Assume that we have n identical processors, and a number of tasks to perform. Each task T i requires an amount of time pi to complete, 0 < CL. 1 i k, so that k is an upper bound on task length. Tasks are indivisible, so that a processor on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress in Informatics
سال: 2012
ISSN: 1349-8614,1349-8606
DOI: 10.2201/niipi.2012.9.2